Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Many numerical computations show a small difference only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.